Leaf-to-leaf distances in ordered Catalan tree graphs
نویسندگان
چکیده
We study the average leaf-to-leaf path lengths on ordered Catalan tree graphs with n nodes and show that these are equivalent to the average length of paths starting from the root node. We give an explicit analytic formula for the average leafto-leaf path length as a function of separation of the leaves and study its asymptotic properties. At the heart of our method is a strategy based on an abstract graph representation of generating functions which we hope can be useful also in other contexts.
منابع مشابه
Leaf-to-leaf distances and their moments in finite and infinite ordered m-ary tree graphs.
We study the leaf-to-leaf distances on one-dimensionally ordered, full and complete m-ary tree graphs using a recursive approach. In our formulation, unlike in traditional graph theory approaches, leaves are ordered along a line emulating a one-dimensional lattice. We find explicit analytical formulas for the sum of all paths for arbitrary leaf separation r as well as the average distances and ...
متن کاملA Combinatorial Interpretation for a Super-Catalan Recurrence
Nicholas Pippenger and Kristin Schleich have recently given a combinatorial interpretation for the second-order super-Catalan numbers (un)n 0 = (3; 2; 3; 6; 14; 36; :::): they count \aligned cubic trees" on n internal vertices. Here we give a combinatorial interpretation of the recurrence un = Pn=2 1 k=0 n 2 2k 2 2 uk : it counts these trees by number of deep interior vertices where deep interi...
متن کاملEffect of tree decline and slope aspect on the leaf morphological traits of Persian oak trees
This study was accomplished with the aim of investigating the effects of tree decline and slope aspect on leaf morphological traits and determining the indicator morphological traits that indicate the leaf diversity of Persian oak trees in relation to habitat conditions and environmental stresses in Mellah Siah forests of Ilam. Two forest habitats were selected on the northern and southern slop...
متن کاملMulti-label Classification for Tree and Directed Acyclic Graphs Hierarchies
Hierarchical Multi-label Classification (HMC) is the task of assigning a set of classes to a single instance with the peculiarity that the classes are ordered in a predefined structure. We propose a novel HMC method for tree and Directed Acyclic Graphs (DAG) hierarchies. Using the combined predictions of locals classifiers and a weighting scheme according to the level in the hierarchy, we selec...
متن کاملOld and young leaves on plane trees
A leaf of a plane tree is called an old leaf if it is the leftmost child of its parent, and it is called a young leaf otherwise. In this paper we enumerate plane trees with a given number of old leaves and young leaves. The formula is obtained combinatorially by presenting two bijections between plane trees and 2-Motzkin paths which map young leaves to red horizontal steps, and old leaves to up...
متن کامل